Probing nonlinear adiabatic paths with a universal integrator
نویسندگان
چکیده
منابع مشابه
Probing nonlinear adiabatic paths with a universal integrator
We apply a flexible numerical integrator to the simulation of adiabatic quantum computation with nonlinear paths. We find that a nonlinear path may significantly improve the performance of adiabatic algorithms versus the conventional straight-line interpolations. The employed integrator is suitable for solving the time-dependent Schrödinger equation for any qubit Hamiltonian. Its flexible stora...
متن کاملLocal adiabatic quantum search with different paths
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path via a ’sure success’ Hamiltonian is introduced and is shown that the time required to find an item in a database of size N can be made to be almost independent of the size of the dat...
متن کاملQuantum Adiabatic Evolution Algorithms with Different Paths
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the “straight line” path from initial to final Hamilt...
متن کاملAdiabatic Paths and Pseudoholomorphic Curves
We consider the Taubes correspondencebetween solutions of the Seiberg– Witten equations on a compact 4-dimensional symplectic manifold and pseudoholomorphic curves on this manifold. We compare it with its 3-dimensional analogue in which the roles of Seiberg–Witten equations and pseudoholomorphic curves are played respectively by the Ginzburg–Landau equations and adiabatic paths in the moduli sp...
متن کاملA Universal Adiabatic Quantum Query Algorithm
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discretetime model of quantum computation, it also holds for continuous-time (or Hamiltonianbased) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2014
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.89.032308